On Fixed Point error analysis of FFT algorithm
نویسندگان
چکیده
In this correspondence the analysis of overall quantization loss for the Fast Fourier Transform (FFT) algorithms is extended to the case where the twiddle factor word length is different from the register word length. First, a statistical noise model to predict the Quantization error after the multiplication of two quantized signals, of different precision, is presented. This model is then applied to FFT algorithms. Simulation results, that corroborate the theoretical analysis, are then presented.
منابع مشابه
ASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm
Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...
متن کاملA Block Floating Point Implementation for an N-Point FFT on the TMS320C55x DSP
A block floating-point (BFP) implementation provides an innovative method of floating-point emulation on a fixed-point processor. This application report implements the BFP algorithm for the Fast Fourier Transform (FFT) algorithm on a Texas Instruments (TI) TMS320C55x DSP by taking advantage of the CPU exponent encoder. The BFP algorithm as it applies to the FFT allows signal gain adjustment i...
متن کاملAN2768, Implementation of a 128-Point FFT on the MRC6011 Device
1 Basics of Fast Fourier Transform ............................. 2 1.1 Decimation in Time and in Frequency ......................2 1.2 Radix-2 and Radix-4 ..................................................4 1.3 Bit-reversal .................................................................6 2 MRC6011 Architecture Overview ............................ 6 2.1 Frame Buffer .............................
متن کاملThe Design and Implementation of FFT Algorithm Based on The Xilinx FPGA IP Core
This paper introduces a kind of FFT algorithm design and realization based on the Xilinx IP core . On the analysis of FFT algorithm, Rely on Xilinx Spartan -3A DSP FPGA series as platform, by calling FFT IP core, validating the feasibility and reliability in FFT algorithm medium or lower end FPGA. Keywords-FFT algorithm module, Xilinx IP core, Spartan 3A DSP, Fixed-point compression
متن کاملFixed-point FPGA Implementation of a Kalman Filter for Range and Velocity Estimation of Moving Targets
Tracking filters are extensively used within object tracking systems in order to provide consecutive smooth estimations of position and velocity of the object with minimum error. Namely, Kalman filter and its numerous variants are widely known as simple yet effective linear tracking filters in many diverse applications. In this paper, an effective method is proposed for designing and implementa...
متن کامل